Neural Approximate Dynamic Programming for On-Demand Ride-Pooling
نویسندگان
چکیده
منابع مشابه
Approximate Dynamic Programming for High-Dimensional Problems
There is a wide range of simulation problems that involve making decisions during the simulation, where we would like to make the best decisions possible, taking into account not only what we know when we make the decision, but also the impact of the decision on the future. Such problems can be formulated as dynamic programs, stochastic programs and optimal control problems, but these technique...
متن کاملSparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the complexity implied by the required naturalness of dialogue systems and the inability of standard RL algorithms to scale up. Another issue is the sparsity of the data available for training in the dialogue domain which can ...
متن کاملApproximate Dynamic Programming via Linear Programming
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...
متن کاملApproximate Dynamic Programming for Ship Course Control
Dynamic programming (DP) is a useful tool for solving many control problems, but for its complexity in computation, traditional DP control algorithms are not satisfactory in fact. So we must look for a new method which not only has the advantages of DP but also is easier in computation. In this paper, approximate dynamic programming (ADP) based controller system has been used to solve a ship he...
متن کاملApproximate Dynamic Programming For Sensor Management
This paper studies the problem of dynamic scheduling of multi-mode sensor resources for the problem of classification of multiple unknown objects. Because of the uncertain nature of the object types, the problem is formulated as a partially observed Markov decision problem with a large state space. The paper describes a hierarchical algorithm approach for efficient solution of sensor scheduling...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i01.5388